Exponential time hypothesis

Results: 28



#Item
11CS369E: Communication Complexity (for Algorithm Designers) Lecture #7: Lower Bounds in Algorithmic Game Theory∗ Tim Roughgarden† March 5, 2015

CS369E: Communication Complexity (for Algorithm Designers) Lecture #7: Lower Bounds in Algorithmic Game Theory∗ Tim Roughgarden† March 5, 2015

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2015-09-14 17:18:05
12A SAT-based Method for Solving the Two-dimensional Strip Packing Problem Takehide Soh1 , Katsumi Inoue12 , Naoyuki Tamura3 , Mutsunori Banbara3 , and Hidetomo Nabeshima4 1

A SAT-based Method for Solving the Two-dimensional Strip Packing Problem Takehide Soh1 , Katsumi Inoue12 , Naoyuki Tamura3 , Mutsunori Banbara3 , and Hidetomo Nabeshima4 1

Add to Reading List

Source URL: tmancini.di.uniroma1.it

Language: English - Date: 2008-12-16 11:07:40
13Economics and Computation ECONand CPSCProfessor Dirk Bergemann and Professor Joan Feigenbaum Lecture IV

Economics and Computation ECONand CPSCProfessor Dirk Bergemann and Professor Joan Feigenbaum Lecture IV

Add to Reading List

Source URL: zoo.cs.yale.edu

Language: English - Date: 2008-10-07 04:07:53
14Quadratic Conditional Lower Bounds for String Problems and Dynamic Time Warping Karl Bringmann∗ Marvin Künnemann†

Quadratic Conditional Lower Bounds for String Problems and Dynamic Time Warping Karl Bringmann∗ Marvin Künnemann†

Add to Reading List

Source URL: people.mpi-inf.mpg.de

Language: English - Date: 2016-01-03 06:47:08
15Why walking the dog takes time: Fr´echet distance has no strongly subquadratic algorithms unless SETH fails Karl Bringmann∗ April 10, 2014  Abstract

Why walking the dog takes time: Fr´echet distance has no strongly subquadratic algorithms unless SETH fails Karl Bringmann∗ April 10, 2014 Abstract

Add to Reading List

Source URL: people.mpi-inf.mpg.de

Language: English - Date: 2016-01-03 06:46:32
16On the Virtue of Succinct Proofs: Amplifying Communication Complexity Hardness to Time-Space Trade-offs in Proof Complexity [Extended Abstract] Trinh Huynh

On the Virtue of Succinct Proofs: Amplifying Communication Complexity Hardness to Time-Space Trade-offs in Proof Complexity [Extended Abstract] Trinh Huynh

Add to Reading List

Source URL: www.complexity.ethz.ch

Language: English - Date: 2012-03-28 07:53:42
17Almost Optimal Exploration in Multi-Armed Bandits  Zohar Karnin Yahoo! Labs, Haifa, Israel Tomer Koren† Technion—Israel Institute of Technology, Haifa, Israel

Almost Optimal Exploration in Multi-Armed Bandits Zohar Karnin Yahoo! Labs, Haifa, Israel Tomer Koren† Technion—Israel Institute of Technology, Haifa, Israel

Add to Reading List

Source URL: jmlr.org

Language: English - Date: 2013-08-14 01:36:43
18The Computer Journal Special Issue on Parameterized Complexity: Foreward by the Guest Editors Rodney G. Downey Victoria University Wellington, New Zealand

The Computer Journal Special Issue on Parameterized Complexity: Foreward by the Guest Editors Rodney G. Downey Victoria University Wellington, New Zealand

Add to Reading List

Source URL: www.mrfellows.net

Language: English - Date: 2009-10-06 03:04:07
19On the possibility of faster SAT algorithms Mihai Pˇatra¸scu∗ AT&T Labs Florham Park, NJ  Ryan Williams†

On the possibility of faster SAT algorithms Mihai Pˇatra¸scu∗ AT&T Labs Florham Park, NJ Ryan Williams†

Add to Reading List

Source URL: www.stanford.edu

Language: English - Date: 2009-11-12 23:47:30
20Towards Fully Multivariate Algorithmics: Some New Results and Directions in Parameter Ecology Michael Fellows University of Newcastle, Callaghan, Australia

Towards Fully Multivariate Algorithmics: Some New Results and Directions in Parameter Ecology Michael Fellows University of Newcastle, Callaghan, Australia

Add to Reading List

Source URL: www.mrfellows.net

Language: English - Date: 2009-10-06 02:49:42